An EXPSPACE Tableaux-Based Algorithm for SHOIQ
نویسندگان
چکیده
In this paper, we propose an EXPSPACE tableaux-based algorithm for SHOIQ. The construction of this algorithm is founded on the standard tableauxbased method for SHOIQ and the technique used for designing a NEXPTIME algorithm for the two-variable fragment of first-order logic with counting quantifiers C.
منابع مشابه
An ExpSpace Tableau-based Algorithm for SHOIQ
In this paper, we propose an EXPSPACE tableau-based algorithm for SHOIQ. The construction of this algorithm is founded on the standard tableaubased method for SHOIQ and the technique used for designing a NEXPTIME algorithm for the two-variable fragment of first-order logic with counting quantifiers C.
متن کاملExtending the SHOIQ(D) Tableaux with DL-safe Rules: First Results
On the Semantic Web, there has been increasing demand for a ruleslike expressivity that goes beyond OWL-DL. Efforts of combining rules languages and description logics usually produce undecidable formalisms, unless constrained in a specific way. We look at one of the most expressive but decidable such formalisms proposed: DL-safe rules, and present a tableaux-based algorithm for query answering...
متن کاملA Tableaux Decision Procedure for SHOIQ
This paper presents a tableaux decision procedure for SHOIQ, the DL underlying OWL DL. To the best of our knowledge, this is the first goal-directed decision procedure for SHOIQ.
متن کاملA Tableau Decision Procedure for SHOIQ
OWL DL, a newW3C ontology language recommendation, is based on the expressive description logic SHOIN . Although the ontology consistency problem for SHOIN is known to be decidable, up to now there has been no known “practical” decision procedure, i.e., a goal directed procedure that is likely to perform well with realistic ontology derived problems. We present such a decision procedure for SHO...
متن کاملExtending CARIN to the Description Logics of the SH Family
This work studies the extension of the existential entailment algorithm of CARIN to DLs of the SH family. The CARIN family of knowledge representation languages was one of the first hybrid languages combining DATALOG rules and Description Logics. For reasoning in one of its prominent variants, which combines ALCNR with non-recursive DATALOG, the blocking conditions of the standard tableaux proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013